disjoint selection

См. также в других словарях:

• disjoint selection — trūkioji atranka statusas T sritis informatika apibrėžtis ↑Atranka, sudaryta iš keleto logiškai nesusijusių arba ne iš eilės išdėstytų objektų. Yra įvairių būdų objektams atrinkti – trūkiajai išrankai sukurti, pavyzdžiui, spustelėti dešiniuoju… …   Enciklopedinis kompiuterijos žodynas

• trūkioji atranka — statusas T sritis informatika apibrėžtis ↑Atranka, sudaryta iš keleto logiškai nesusijusių arba ne iš eilės išdėstytų objektų. Yra įvairių būdų objektams atrinkti – trūkiajai išrankai sukurti, pavyzdžiui, spustelėti dešiniuoju pelės klavišu,… …   Enciklopedinis kompiuterijos žodynas

• Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… …   Wikipedia

• Near sets — are disjoint sets that resemble each other. Resemblance between disjoint sets occurs whenever there are observable similarities between the objects in the sets. Similarity is determined by comparing lists of object feature values. Each list of… …   Wikipedia

• Axiom of choice — This article is about the mathematical concept. For the band named after it, see Axiom of Choice (band). In mathematics, the axiom of choice, or AC, is an axiom of set theory stating that for every family of nonempty sets there exists a family of …   Wikipedia

• Relational algebra — Not to be confused with Relation algebra. Relational algebra, an offshoot of first order logic (and of algebra of sets), deals with a set of finitary relations (see also relation (database)) that is closed under certain operators. These operators …   Wikipedia

• Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… …   Wikipedia

• Probability space — This article is about mathematical term. For the novel, see Probability Space (novel). In probability theory, a probability space or a probability triple is a mathematical construct that models a real world process (or experiment ) consisting of… …   Wikipedia

• Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network …   Wikipedia

• Multivariate adaptive regression splines — (MARS) is a form of regression analysis introduced by Jerome Friedman in 1991.[1] It is a non parametric regression technique and can be seen as an extension of linear models that automatically models non linearities and interactions. The term… …   Wikipedia

• Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… …   Wikipedia